Finding minimum clique capacity
نویسندگان
چکیده
Let C be a clique of a graph G. The capacity of C is defined to be (|V (G) \ C|+ |D|)/2, where D is the set of vertices in V (G) \C that have both a neighbour and a non-neighbour in C. We give a polynomial-time algorithm to find the minimum clique capacity in a graph G. This problem arose as an open question in a study [1] of packing vertex-disjoint induced three-vertex paths in a graph with no stable set of size three.
منابع مشابه
EDAM: An Efficient Clique Discovery Algorithm with Frequency Transformation for Finding Motifs
Finding motifs in DNA sequences plays an important role in deciphering transcriptional regulatory mechanisms and drug target identification. In this paper, we propose an efficient algorithm, EDAM, for finding motifs based on frequency transformation and Minimum Bounding Rectangle (MBR) techniques. It works in three phases, frequency transformation, MBR-clique searching and motif discovery. In f...
متن کاملNew Ternary and Quaternary Equidistant Constant Weight Codes
We consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes. We present a computer realization of an algorithm for solving the maximum clique problem. We use it for finding the exact values of the maximum size for ternary and quaternary equidistant constant weight codes for all open cases for n ≤ 10 are found.
متن کاملOn Condensation of a Clause
In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correct proof of the relationship between subsumption and the existence of cliques in a total matcher graph. Next, we introduce the concept of width of a clique in a total matcher graph. As a corollary of the above relations...
متن کاملOn the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels
We consider the clique problem in graphs, which is NP-complete, and try to find a quantum analogue of this problem. We show that, quantum clique problem can be defined as follows. Given a quantum channel, are there k states that are distinguishable, with no error, after passing through channel. This definition comes from reconsidering the clique problem in terms of the zero-error capacity of gr...
متن کاملAlgorithms for finding clique-transversals of graphs
A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. It is NP-hard to determine the minimum cardinality τc of a clique-transversal of G. In this work, first we propose an algorithm for determining this parameter for a general graph, which runs in polynomial time, for fixed τc. This algorithm is employed for finding the minimum cardinality clique-transvers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 32 شماره
صفحات -
تاریخ انتشار 2012